Uni cation of Concept Terms in Description

نویسندگان

  • Franz Baader
  • Paliath Narendran
چکیده

Uniication of concept terms is a new kind of inference problem for Description Logics, which extends the equivalence problem by allowing to substitute certain concept names by concept terms before testing for equivalence. We show that this inference problem is of interest for applications, and present rst decidability and complexity results for a small concept description language. 1 Motivation The rst motivation for considering uniication of concept terms comes from an application in chemical process engineering 4]. In this application, the DL system is used to support the design of a large terminology of concepts describing parts of chemical plants as well as processes that take place in these plants. Since several knowledge engineers are involved in deening new concepts, and since this knowledge acquisition process takes rather long (several years), it happens that the same (intuitive) concept is introduced several times, often with slightly diiering descriptions. Our goal was to use the reasoning capabilities of the DL system (in particular, testing for equivalence of concept terms) to support avoiding this kind of redundancy. However, testing for equivalence of concepts is not always suucient to nd out whether, for a given concept term, there already exists another concept term in the knowledge base describing the same notion. For example, assume that one knowledge engineer has deened the concept of all women having only daughters 1 by the concept term Woman u 8child:Woman: 1 We use an example from the family domain since examples from process engineering would require too much explanation. A second knowledge engineer might represent this notion in a somewhat more ne-grained way, e.g., by using the term Female u Human in place of Woman. The concept terms Woman u 8child:Woman and Female u Human u 8child:(Female u Human) are not equivalent, but they are meant to represent the same concept. The two terms can obviously be made equivalent by substituting the atomic concept Woman in the rst term by the concept term Female u Human. question whether two concept terms C; D can be made equivalent by applying an appropriate substitution , where a substitution replaces (some of the) atomic concepts by concept terms. A substitution is a uniier of C; D ii (C) (D) (where denotes equivalence of concept terms). Of course, it is not necessarily the case that uniiable concept terms are meant to represent the same notion. A uniiability test can, however, suggest to …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polytypic Uni cation

Uni cation or two way pattern matching is the process of solving an equation involving two rst order terms with variables Uni cation is used in type inference in many pro gramming languages and in the execution of logic programs This means that uni cation algorithms have to be written over and over again for di erent term types Many other functions also make sense for a large class of datatypes...

متن کامل

GENERALIZED UNI-SOFT INTERIOR IDEALS IN ORDERED SEMIGROUPS

For all M,N∈P(U) such that M⊂N, we first introduced the definitions of (M,N)-uni-soft ideals and (M,N)-uni-soft interior ideals of an ordered semigroup and studied them. When M=∅ and N=U, we meet the ordinary soft ones. Then we proved that in regular and in intra-regular ordered semigroups the concept of (M,N)-uni-soft ideals and the (M,N)-uni-soft interior ideals coincide. Finally, we introduc...

متن کامل

Matching and Uni cation in Rewrite Theories

\Semantic uni cation" is the process of generating a basis set of substitutions (of terms for variables) that makes two given terms equal in a speci ed theory. Semantic uni cation is an important component of some theorem provers. \Semantic matching," a simpler variant of uni cation, where the substitution is made in only one of the terms, has potential usage in programming language interpreter...

متن کامل

Decidable Higher-Order Unification Problems

Second order uni cation is undecidable in general Miller showed that uni cation of so called higher order patterns is decidable and unitary We show that the uni cation of a linear higher order pat tern s with an arbitrary second order term that shares no variables with s is decidable and nitary A few extensions of this uni cation problem are still decidable unifying two second order terms where...

متن کامل

Uni cation in a Description Logic with Transitive Closure of Roles

Uniication of concept descriptions was introduced by Baader and Narendran as a tool for detecting redundancies in knowledge bases. It was shown that uniication in the small description logic FL 0 , which allows for conjunction, value restriction, and the top concept only, is already ExpTime complete. The present paper shows that the complexity does not increase if one additionally allows for co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998